Lecture Notes on Testing Graph Properties in the Bounded-Degree Graph Model
نویسنده
چکیده
1. Presenting lower and upper bounds on the complexity of testing Bipartitness; specifically, we present a poly(1/ǫ) · Õ( √ k)-time tester, and an Ω √ k) lower bound on the query complexity of any tester for Bipartitness. 2. Reviewing a quasi-poly(1/ǫ)-time tester for Planarity. The result extends to testing any minor-closed property (i.e., a graph property that is preserved under the omission of edges and vertices and under edge contraction).
منابع مشابه
Lecture Notes on Testing Graph Properties in the General Graph Model
Teaching note: Although it is possible to study the current chapter without first studying the Chapter 9, we strongly recommend not doing so. Basic familiarity with the bounded-degree graph model seems necessary for a good perspective on the general graph model. In addition, familarity with some of the results and ideas of Chapter 9 will greatly facilitate the study of current chapter. Specific...
متن کاملLecture Notes on Testing Graph Properties in the Dense Graph Model
Organization. The current lecture is the first out of a series of three lectures that cover three models for testing graph properties. In each model, we spell out the definition of property testing (when specialized to that model), present some of the known results, and demonstrate some of the ideas involved (by focusing on testing Bipartiteness, which seems a good benchmark). We start the curr...
متن کاملTesting Hereditary Properties of Nonexpanding Bounded-Degree Graphs
We study graph properties which are testable for bounded degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined graph property and graphs that are far from every graph having that property. It is believed that almost all, even very simple graph properties require a large complexity to be tested for arbitrary (bounded degree) graphs....
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملBounded-Degree Graphs have Arbitrarily Large Geometric Thickness
The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppstein [Separating thickness from geometric thickness. In Towards a Theory of Geometric Graphs, vol. 342 of Contemp. Math., AMS, 2004] asked whether every graph of bounded maximum degree has bounded geometric thickness. We answer t...
متن کامل